The scaling limit of the Minimal Spanning Tree — a preliminary report
نویسنده
چکیده
This is a brief description of how the recent proof of the existence and conformal covari-ance of the scaling limits of dynamical and near-critical planar percolation implies the existence and several topological properties of the scaling limit of the Minimal Spanning Tree, and that it is invariant under scalings, rotations and translations. However, we do not expect conformal invariance: we explain why not and what is missing for a proof.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملScaling Limits of the Uniform Spanning Tree and Loop-erased Random Walk on Finite Graphs
Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the torus Zn for d ≥ 5. Moreover, on this family of graphs we show that a suitably normalized finite-dimensional scaling limit of the uniform spanning tree is a Brownian continuum random tree.
متن کاملMinimal Spanning Tree Graphs and Power like Scaling in Forex Networks
Correlation matrices of foreign exchange rate time series are investigated for 60 world currencies. Minimal Spanning Tree (MST) graphs for the gold, silver and platinum are presented. Inverse power like scaling is discussed for these graphs as well as for four distinct currency groups (major, liquid, less liquid and non-tradable). The worst scaling has been found for USD and related currencies.
متن کامل